An Upper Bound on the Sizes of Multiset-Union-Free Families
نویسندگان
چکیده
Let F1 and F2 be two families of subsets of an n-element set. We say that F1 and F2 are multiset-union-free if for any A,B ∈ F1 and C,D ∈ F2 the multisets A ⊎ C and B ⊎D are different, unless both A = B and C = D. We derive a new upper bound on the maximal sizes of multiset-union-free pairs, improving a result of Urbanke and Li.
منابع مشابه
An Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملAn Upper Bound Approach for Analysis of Hydroforming of Sheet Metals
Considering a kinematical velocity admissible field, the upper bound method has beenused for predicting the amount of pressure in hydroforming of sheet metals. The effects of workhardening, friction and blank size have been considered in pressure prediction. Also the effect ofsheet thickness variation has been considered in the present work formulations. The relation betweenpressure and punch s...
متن کاملOn trees attaining an upper bound on the total domination number
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. The total domination number of a graph $G$, denoted by $gamma_t(G)$, is~the minimum cardinality of a total dominating set of $G$. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004), 6...
متن کاملA generalized upper bound solution for bimetallic rod extrusion through arbitrarily curved dies
In this paper, an upper bound approach is used to analyze the extrusion process of bimetallic rods through arbitrarily curved dies. Based on a spherical velocity field, internal, shearing and frictional power terms are calculated. The developed upper bound solution is used for calculating the extrusion force for two types of die shapes: a conical die as a linear die profile and a streamlined di...
متن کاملUnion-free Hypergraphs and Probability Theory
Notice that the upper bound is an immediate consequence of (I<;J) :s;; 2n. To prove the lower bound we use an algebraic construction which is a modification of a construction of Babai and S6s [1]. How a family of sets can fail to have the union-free property? There are essentially two possibilities: (a) there are four distinct sets A, B, C, D with Au B =CuD. (b) there are three distinct sets A,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 30 شماره
صفحات -
تاریخ انتشار 2016